Thompson's group F is 1-counter graph automatic
نویسندگان
چکیده
It is not known whether Thompson's group F is automatic. With the recent extensions of the notion of an automatic group to graph automatic by Kharlampovich, Khoussainov and Miasnikov and then to C-graph automatic by the authors, a compelling question is whether F is graph automatic or C-graph automatic for an appropriate language class C. The extended definitions allow the use of a symbol alphabet for the normal form language, replacing the dependence on generating set. In this paper we construct a 1-counter graph automatic structure for F based on the standard infinite normal form for group elements.
منابع مشابه
$\mathcal C$-graph automatic groups
We generalize the notion of a graph automatic group introduced by Kharlampovich, Khoussainov and Miasnikov by replacing the regular languages in their definition with more powerful language classes. For a fixed language class C, we call the resulting groups C-graph automatic. We prove that the class of C-graph automatic groups is closed under change of generating set, direct and free product fo...
متن کاملSome Graphs Related to Thompson's Group F
The Schreier graphs of Thompson’s group F with respect to the stabilizer of 12 and generators x0 and x1, and of its unitary representation in L2([0, 1]) induced by the standard action on the interval [0, 1] are explicitly described. The coamenability of the stabilizers of any finite set of dyadic rational numbers is established. The induced subgraph of the right Cayley graph of the positive mon...
متن کاملNew characterization of some linear groups
There are a few finite groups that are determined up to isomorphism solely by their order, such as $mathbb{Z}_{2}$ or $mathbb{Z}_{15}$. Still other finite groups are determined by their order together with other data, such as the number of elements of each order, the structure of the prime graph, the number of order components, the number of Sylow $p$-subgroups for each prime $p$, etc. In this...
متن کاملDiagram Groups Are Totally Orderable
In this paper, we introduce the concept of the independence graph of a directed 2-complex. We show that the class of diagram groups is closed under graph products over independence graphs of rooted 2-trees. This allows us to show that a diagram group containing all countable diagram groups is a semi-direct product of a partially commutative group and R. Thompson's group F. As a result, we prove...
متن کاملar X iv : m at h / 05 06 34 6 v 1 [ m at h . G R ] 1 7 Ju n 20 05 COMPUTATIONAL EXPLORATIONS IN THOMPSON ’ S GROUP F
Here we describe the results of some computational explorations in Thompson's group F. We describe experiments to estimate the cogrowth of F with respect to its standard finite generating set, designed to address the subtle and difficult question whether or not Thompson's group is amenable. We also describe experiments to estimate the exponential growth rate of F and the rate of escape of symme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Groups Complexity Cryptology
دوره 8 شماره
صفحات -
تاریخ انتشار 2016